Balance Routing Traffic in Generalized Shuffle-Exchange Network

نویسندگان

  • Zhen Chen
  • Zeng-Ji Liu
  • Zhi-Liang Qiu
  • Peng Chen
  • Xiao-Ming Tao
چکیده

Zhen Chen, Zeng-Ji Liu, Zhi-Liang Qiu, Peng Chen, and Xiao-Ming Tao Abstract—Under equiprobable address of uniform packet traffic at input port, we find, the GSEN will route such traffic unevenly, an abnormal phenomenon caused by using unbalanced routing tags. We address and formulate this problem. To balance the routing traffic, the idea to use routing tag according to a probability is explained. By using Moore-Penrose pseudoinverse in matrix analysis, a methodology to solve this problem is proposed. An instance is given, and the simulation is done to verify our idea, which shows a big performance improvement by our methodology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Shuffle - Exchange Networks : Combinatorial and Fault Tolerant Properties

Shuffle-exchange networks have been proposed as an attractive choice for interconnection networks. They have constant node degree and sublogarithmic diameter. Several researchers have studied various combinatorial and interconnection properties of them. In this paper, we generalize shuffle-exchange networks and define a new class of networks, called generalized shuffle-exchange network and deno...

متن کامل

Hypercube Networks - III

1. Review of the previous lecture This section highlights the problem of routing a hard problem on the butterfly network. 2. Valiant’s Algorithm This section describes the idea behind Valiant’s algorithm for solving a hard problem on the butterfly network. 3. Ranade’s Algorithm This section briefly introduces Ranade’s algorithm. 4. Shuffle-exchange graph This section explains the properties of ...

متن کامل

Energy optimization based on routing protocols in wireless sensor network

Considering the great significant role that routing protocols play in transfer rate and choosing the optimum path for exchange of data packages, and further in the amount of consumed energy in the routing protocol, the present study has focused on developing an efficient compound energy algorithm based on cluster structure which is called active node with cluster structure. The purpose of this ...

متن کامل

Reliability Evaluation and Routing Integration in Shuffle Exchange Omega Network

Multistage Interconnection Networks (MINs) are design to provide an effective communication in switching. Shuffle-exchange networks (SENs) have been widely considered as practical interconnection systems due to their size of it switching elements (SEs) and uncomplicated configuration. In this paper, the relationship between reliability performance and number of network size are compared in shuf...

متن کامل

Adaptive Load Balanced Routing for 2-Dilated Flattened Butterfly Switching Network

High-radix networks such as folded-Clos outperform other low radix networks in terms of cost and latency. The 2-dilated flattened butterfly (2DFB) network is a nonblocking high-radix network with better path diversity and reduced diameter compared to the folded-Clos network. In this paper, we introduce an adaptive load balanced routing algorithm that is designed to exploit all the positive topo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013